Time complexity - PDFSEARCH.IO - Document Search Engine

Time complexity
Results: 894

#	Item
261	Lower Bounds on Rate of Convergence of Cutting Plane Methods Xinhua Zhang Dept. of Computing Science University of Alberta Add to Reading List Source URL: people.cs.uchicago.edu Language: English - Date: 2010-11-03 13:50:24 Operations research Mathematical optimization Support vector machines Convex optimization Statistical classification Sequential minimal optimization Linear programming Time complexity Dynamic programming Mathematics Algebra Theoretical computer science
262	Optimal-Time Adaptive Strong Renaming, with Applications to Counting [Extended Abstract] Dan Alistarh ∗ EPFL Add to Reading List Source URL: www.comp.nus.edu.sg Language: English - Date: 2011-11-17 23:45:10 Sorting algorithms Computational complexity theory Analysis of algorithms Algorithm Mathematical logic Randomized algorithm Time complexity Consensus Sorting network Theoretical computer science Applied mathematics Mathematics
263	Unlike most of my friends at PCP, I had never had a chance to live abroad and experience different culture. I was born in Osaka, and I had spent my whole time in Osaka until I entered University. So honestly, when I join Add to Reading List Source URL: www.econ.keio.ac.jp Language: English - Date: 2015-03-30 05:27:38 Phencyclidine Medicine Biochemistry Neurochemistry Probabilistic complexity theory Probabilistically checkable proof
264	FlashStack Converged Infrastructure Simple, Rapid Deployment of 100% Flash Business-Critical IT Infrastructure The Challenge: Data Center Complexity The deployment of data center infrastructure can be complex, time consu Add to Reading List Source URL: www.purestorage.com Language: English - Date: 2015-05-28 17:40:37 Converged infrastructure Pure Storage Data center Virtualization Blade server Flash memory Converged storage Desktop virtualization Computing Computer hardware Computer-mediated communication
265	CCCG 2011, Toronto ON, August 10–12, 2011 Minimum Many-to-Many Matchings for Computing the Distance Between Two Sequences Mustafa Mohamad Add to Reading List Source URL: 2011.cccg.ca Language: English - Date: 2011-08-06 04:11:13 Combinatorial optimization Matching Analysis of algorithms Operations research Dynamic programming Optimal control Hungarian algorithm Algorithm Time complexity Theoretical computer science Mathematics Applied mathematics
266	ICS 161 — Algorithms — Winter 1998 — Final Exam Name: ID: Add to Reading List Source URL: www.ics.uci.edu Language: English - Date: 1998-11-13 18:59:50 NP-complete problems Mathematical optimization Analysis of algorithms Time complexity NP-complete Spreadsheet Approximation algorithm Algorithm Directed acyclic graph Theoretical computer science Applied mathematics Computational complexity theory
267	CS 373: Combinatorial Algorithms, Spring 2001 http://www-courses.cs.uiuc.edu/~cs373 Homework 5 (due Tue. Apr. 17, 2001 at 11:59 pm) Name: Net ID: Add to Reading List Source URL: web.engr.illinois.edu Language: English - Date: 2014-12-28 08:52:34 String matching algorithms Analysis of algorithms Fibonacci number Sorting algorithms String searching algorithm Knuth–Morris–Pratt algorithm Algorithm Time complexity Theoretical computer science Applied mathematics Mathematics
268	Faster deterministic integer factorisation David Harvey (joint work with Edgar Costa, NYU) University of New South Wales 25th October 2011 Add to Reading List Source URL: web.maths.unsw.edu.au Language: English - Date: 2011-10-24 19:42:20 Applied mathematics Integer factorization General number field sieve Quadratic sieve Time complexity Lenstra elliptic curve factorization Factorization Prime number Algorithm Theoretical computer science Integer factorization algorithms Mathematics
269	Limits and Applications of Group Algebras for Parameterized Problems Ioannis Koutis Computer Science Department Carnegie Mellon University Add to Reading List Source URL: ccom.uprrp.edu Language: English - Date: 2011-03-02 23:56:28 Analysis of algorithms Polynomials Algebraic geometry Commutative algebra Parameterized complexity XTR Kernelization Randomized algorithm Time complexity Theoretical computer science Mathematics Computational complexity theory
270	CCCG 2007, Ottawa, Ontario, August 20–22, 2007 On a geometric approach to the segment sum problem and its generalization Asish Mukhopadhyay Abstract Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-28 21:30:20 Analysis of algorithms Time complexity Algorithm Selection algorithm SL Theoretical computer science Computational complexity theory Applied mathematics

UPDATE